On a problem of Neumann

A conjecture widely attributed to Neumann is that all finite non-desarguesian projective planes contain a Fano subplane. In this note, we show that any finite projective plane of even order which admits an orthogonal polarity contains many Fano subplanes. The number of planes of order less than $n$ previously known to contain a Fano subplane was $O(logn)$, whereas the number of planes of order less than $n$ that our theorem applies to is not bounded above by any polynomial in $n$.     

The graphs that have antivoltages using groups of small order

Given a group $\Gamma$ of order at most six, we characterize the graphs that have $\Gamma$-antivoltages and also determine the list of minor-minimal graphs that have no $\Gamma$-antivoltage. Our characterizations yield polynomial-time recognition algorithms for such graphs.     

The maximum multiplicity of the largest k-th eigenvalue in a matrix whose graph is acyclic or unicyclic

Given a graph $G$ we are interested in studying the symmetric matrices associated to $G$ with a fixed number of negative eigenvalues. For this class of matrices we focus on the maximum possible nullity. For trees this parameter has already been studied and plenty of applications are known. In this work we derive a formula for the maximum nullity and completely describe its behavior as a function of the number of negative eigenvalues. In addition, we also carefully describe the matrices associated with trees that attain this maximum nullity. The analysis is then extended to the more general class of unicyclic graphs. Further our work is applied to re-describing all possible partial inertias associated with trees, and is employed to study an instance of the inverse eigenvalue problem for certain trees.     

Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable

Wang and Lih (2002) conjectured that every planar graph without adjacent triangles is 4-choosable. In this paper, we prove that every planar graph without any 4-cycle adjacent to two triangles is DP-4-colorable, which improves the results of Lam et al. (1999), Cheng et al. (2016) and Kim and Yu [ arXiv:1709.09809v1].     

Oxidative dehydrogenation of n-octane over a vanadium–magnesium oxide catalyst: Influence of the gas hourly space velocity

Oxidative dehydrogenation (ODH) of n-octane was carried out over a vanadium–magnesium oxide catalyst in a continuous flow fixed bed reactor. The catalyst was characterized by ICP–OES, powder XRD and SEM. The catalytic tests were carried out at different gas hourly space velocities (GHSVs), viz. 4000, 6000, 8000, and 10,000 h^?1. The best selectivity for octenes was obtained at the GHSV of 8000 h^?1, while that for C8 aromatics was attained at the GHSV of 6000 h^?1 at high temperatures (500 and 550 °C). The catalytic testing at the GHSV of 10,000 h^?1 showed the lowest activity, while that at the GHSV of 4000 h^?1 consistently showed the lowest ODH selectivity. Generally, the best ODH performance was obtained by the catalytic testing at the GHSVs of 6000 and 8000 h^?1. No phasic changes were observed after the catalytic testing.     

Expected reliability of communication protocols

We consider the problem of sending a message from a sender $s$ to a receiver $r$ through an unreliable network by specifying in a protocol what each vertex is supposed to do if it receives the message from one of its neighbors. A protocol for routing a message in such a graph is finite if it never floods $r$ with an infinite number of copies of the message. The expected reliability of a given protocol is the probability that a message sent from $s$ reaches $r$ when the edges of the network fail independently with probability $1?p$.We discuss, for given networks, the properties of finite protocols with maximum expected reliability in the case when $p$ is close to 0 or 1, and we describe networks for which no one protocol is optimal for all values of $p$. In general, finding an optimal protocol for a given network and fixed probability is challenging and many open problems remain.     

New lower bounds on the radius of spatial analyticity for the KdV equation

The radius of spatial analyticity for solutions of the KdV equation is studied. It is shown that the analyticity radius does not decay faster than $t^{?1/4}$ as time t goes to infinity. This improves the works of Selberg and da Silva (2017) [30] and Tesfahun (2017) [34]. Our strategy mainly relies on a higher order almost conservation law in Gevrey spaces, which is inspired by the I-method.     

Preparation,structure elucidation,and antioxidant activity of new bis(thiosemicarbazone) derivatives

Schiff-base–bearing new bis(thiosemicarbazone) derivatives were prepared from terephthalaldehyde and various thiosemicarbazides. FT–IR, ¹H NMR, ¹³C NMR, and UV–Vis spectroscopic methods and elemental analysis were used to elucidate the identification of the synthesized molecules. The in vitro antioxidant activity of the synthesized compounds was analysed with the 1,1-diphenyl-2-picryl hydrazyl free-radical–trapping process. The synthesized compounds exhibited lower antioxidant activity than the standard ascorbic acid. IC₅₀ values of the synthesized molecules measured from 3.81 ± 0.01 to 29.05 ± 0.11 μM. Among the synthesized compounds, compound 3 had the best antioxidant activity. Moreover, this study explained the structure–activity relationship of the synthesized molecules with different substituents in radical trapping reactions.     

Distinguishability and Disturbance in the Quantum Key Distribution Protocol Using the Mean Multi-Kings’ Problem

We introduce a quantum key distribution protocol using mean multi-kings’ problem. Using this protocol, a sender can share a bit sequence as a secret key with receivers. We consider a relation between information gain by an eavesdropper and disturbance contained in legitimate users’ information. In BB84 protocol, such relation is known as the so-called information disturbance theorem. We focus on a setting that the sender and two receivers try to share bit sequences and the eavesdropper tries to extract information by interacting legitimate users’ systems and an ancilla system. We derive trade-off inequalities between distinguishability of quantum states corresponding to the bit sequence for the eavesdropper and error probability of the bit sequence shared with the legitimate users. Our inequalities show that eavesdropper’s extracting information regarding the secret keys inevitably induces disturbing the states and increasing the error probability.